A Level Set Method for the Dirichlet k-Partition Problem

A BINARY LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION

This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jac...

Solving K-Set Partition Problem Using Genetic Algorithm

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Existence Results for a Dirichlet Quasilinear Elliptic Problem

In this paper, existence results of positive classical solutions for a class of second-order differential equations with the nonlinearity dependent on the derivative are established. The approach is based on variational methods.

Parallelizing a new algorithm for the set partition problem

In this paper we propose a new approach to organizing parallel computing to find a sequence of all solutions to a problem. We split the sequence into subsequences and then execute concurrently the processes to find these subsequences. We propose a new simple algorithm for the set partition problem and apply the above technique for this algorithm.